Gravity gradient routing for information delivery in fog Wireless Sensor Networks
نویسندگان
چکیده
Fog Computing is a new paradigm that has been proposed by CISCO to take full advantage of the ever growing computational capacity of the near-user or edge devices (e.g., wireless gateways and sensors). The paradigm proposes an architecture that enables the devices to host functionality of various usercentric services. While the prospects of Fog Computing promise numerous advantages, development of Fog Services remains under-investigated. This article considers an opportunity of Fog implementation for Alert Services on top of Wireless Sensor Network (WSN) technology. In particular, we focus on targeted WSN-alert delivery based on spontaneous interaction between a WSN and hand-held devices of its users. For the alert delivery, we propose a Gravity Routing concept that prioritizes the areas of high userpresence within the network. Based on the concept, we develop a routing protocol, namely the Gradient Gravity Routing (GGR) that combines targeted delivery and resilience to potential sensor-load heterogeneity within the network. The protocol has been compared against a set of state-of-the-art solutions via a series of simulations. The evaluation has shown the ability of GGR to match the performance of the compared solutions in terms of alert delivery ratio, while minimizing the overall energy consumption of the
منابع مشابه
A Secure Routing Algorithm for Underwater Wireless Sensor Networks
Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...
متن کاملA Priority-based Routing Algorithm for Underwater Wireless Sensor Networks (UWSNs)
Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ad Hoc Networks
دوره 46 شماره
صفحات -
تاریخ انتشار 2016